NP-hardness of the cluster minimization problem revisited

The computational complexity of the \cluster minimization problem" is revisited [L. T. Wille and J. Vennik, J. Phys. A 18, L419 (1985)]. It is argued that the original NP-hardness proof does not apply to pairwise potentials of physical interest, such as those that depend on the geometric distance between the particles. A geometric analog of the original problem is formulated, and a new proof for such potentials is provided by polynomial time transformation from the independent set problem for unit disk graphs. Limitations of this formulation are pointed out, and new subproblems that bear more direct consequences to the numerical study of clusters are suggested. PACS numbers: 36.40.-c, 02.70.-c NP-hardness of cluster minimization 2 The present contribution addresses the inherent computational di culty of nding the ground state con guration R = (r1; : : : ; rN) of a classical N -particle system with total potential energy